Converting Two-Way Nondeterministic Unary Automata into Simpler Automata

نویسندگان

  • Viliam Geffert
  • Carlo Mereghetti
  • Giovanni Pighizzini
چکیده

We show that, on inputs of length exceeding 5n, any n-state unary two-way nondeterministic 4nite automaton (2nfa) can be simulated by a (2n+2)-state quasi-sweeping 2nfa. Such a result, besides providing a “normal form” for 2nfa’s, enables us to get a subexponential simulation of unary 2nfa’s by two-way deterministic 4nite automata (2dfa’s). In fact, we prove that any n-state unary 2nfa can be simulated by a sweeping 2dfa with O(n log2(n+1)+3 ) states. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classical Automata on Promise Problems

Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a single qubit, but the number of states required by corresponding one-way deterministic automata cannot be bounded by a constant. For this family,...

متن کامل

On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata

We investigate the succinctness of several kinds of unary automata by studying their state complexity in accepting the family {Lm} of cyclic languages, where Lm = {a | k ∈ N}. In particular, we show that, for any m, the number of states necessary and sufficient for accepting the unary language Lm with isolated cut point on one-way probabilistic finite automata is p1 1 +p α2 2 + · · ·+ps s , wit...

متن کامل

Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds

It is well known that a context-free language defined over a one-letter alphabet is regular. This implies that unary context-free grammars and unary pushdown automata can be transformed into equivalent finite automata. In this paper, we study these transformations from a descriptional complexity point of view. In particular, we give optimal upper bounds for the number of states of nondeterminis...

متن کامل

Two-Way Finite Automata: Old and Recent Results

The notion of two-way automata was introduced at the very beginning of automata theory. In 1959, Rabin and Scott [31] and, independently, Shepherdson [35], proved that these models, both in the deterministic and in the nondeterministic versions, have the same power of one-way automata, namely, they characterize the class of regular languages. In 1978, Sakoda and Sipser [32] posed the question o...

متن کامل

Ambiguity of Unary Symmetric Difference NFAs

Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001